| 1. | For the so-called strongly regular graphs we shall rewrite the condition in a more attractive form .
对于所谓强正规的图，我们将把条件改写成更有吸引力的形式。 |
| 2. | Rank of subdivision graphs of regular graphs
正则图的剖分图的秩 |
| 3. | Ranks of strong product of regular graphs
正则图的强积的秩 |
| 4. | Eigenpolynomial of the lattices in d - bounded distance - regular graph
界距离正则图中一类格的特征多项式 |
| 5. | A linear algorithm for automatic generation and rectilinear embeddings of four regular graph
四正则图的自动生成及纵横嵌入的线性算法 |
| 6. | We also show strong edge chromatic number of two types of regular graphs with high degree and a note on a result of a . c . burris
给出了两类高度正则图的强边色数，并对a . c . burris的一个结果进行了初步的探讨。 |
| 7. | Using the algorithm ccn ( calculate crossing number ) , this article researches on the relation between the crossing number and girth of the 3 - regular graphs
利用计算交叉数的算法ccn ( calculatecrossingnumber ) ，本文对三正则图的交叉数与围长的关系进行了深入的研究。 |
| 8. | Based on this theory , we discuss rectilinear extensions of two particular kinds of 4 - regular graphs with the minimum total number of bends in this article , and obtain a simple algorithm as well as the minimum total number of bends
本文作者在这一理论的基础上，进一步研究了两个特殊的4 -正则图类，得到了确定这两类图的最小折数纵横扩张的简便算法，并给出了这两类图的纵横扩张的最小折数。 |
| 9. | We also calculate the average crossing number aac ( n ) of all of the 4 - regular graphs for n < 12 and the average crossing number arc ( n ) of some random 4 - regular graphs of degree 4 for n < 16 . at the end of the paper , a conjecture that the average crossing number of regular graph of degree 4 is o ( n2 ) is given
同时计算出n 12的所有四正则图的平均交叉数aac ( n ) ，和n 16的随机四正则图的平均交叉数arc ( n ) ，并根据计算结果提出四正则图的平均交叉数为o ( n ~ 2 )的猜想。 |
| 10. | In this paper , three correlative results are given : 1 ) the average crossing number of graph with n vertices and q edges can be signified approximately by quadratic equation of q . 2 ) the average crossing number of graphs with bigger girth is greater than that with smaller girth within given vertices and edges . 3 ) the average crossing number of r - regular graphs greater than that of non - regular graphs within given vertices and edges where n is odd or r < n / 2
并得出相关的规律： 1 ) n个顶点q条边的单二连通分支图的平均交叉数aac ( n , q )可近似地表示为q的二次多项式， 2 )在给定顶点数n与边数q的单二连通分支图中围长较大的图的平均交叉数大于围长较小的图的平均交叉数， 3 )在给定顶点数n与边数q的单二连通分支图中当n为奇数或r n / 2时， r正则图的平均交叉数大于非r正则图的平均交叉数。 |
